Bounds on Binary Locally Repairable Codes Tolerating Multiple Erasures
نویسندگان
چکیده
Recently, locally repairable codes has gained significant interest for their potential applications in distributed storage systems. However, most constructions in existence are over fields with size that grows with the number of servers, which makes the systems computationally expensive and difficult to maintain. Here, we study linear locally repairable codes over the binary field, tolerating multiple local erasures. We derive bounds on the minimum distance on such codes, and give examples of LRCs achieving these bounds. Our main technical tools come from matroid theory, and as a byproduct of our proofs, we show that the lattice of cyclic flats of a simple binary matroid is atomic.
منابع مشابه
On Sequential Locally Repairable Codes
We consider the locally repairable codes (LRC), aiming at sequential recovering multiple erasures. We define the (n, k, r, t)SLRC (Sequential Locally Repairable Codes) as an [n, k] linear code where any t(≤ t) erasures can be sequentially recovered, each one by r (2 ≤ r < k) other code symbols. Sequential recovering means that the erased symbols are recovered one by one, and an already recovere...
متن کاملOn Sequential Locally Repairable Codes Revised by Guangyue.dvi
We consider the locally repairable codes (LRC), aiming at sequentially recovering multiple erasures; in particular, we propose and study the so-called (n, k, r, t)-SLRC (Sequential Locally Repairable Codes) as an [n, k] linear code where any t (≤ t) erasures can be sequentially recovered, each by r (2 ≤ r < k) other code symbols. Here, a sequential recovering means that the erased symbols are r...
متن کاملA Bound on Rate of Codes with Locality with Sequential Recovery from Multiple Erasures
An [n, k] code C is said to be locally recoverable in the presence of a single erasure, and with locality parameter r, if each of the n code symbols of C can be recovered by accessing at most r other code symbols. An [n, k] code is said to be a locally recoverable code with sequential recovery from t erasures, if for any set of s ≤ t erasures, there is an s-step sequential recovery process, in ...
متن کاملBinary Codes with Locality for Four Erasures
In this paper, binary codes with locality for four erasures are considered. An upper bound on the rate of this class of codes is derived. An optimal construction for codes meeting the bound is also provided. The construction is based on regular bipartite graphs of girth 6 and employs the sequential approach of locally recovering from multiple erasures. An extension of this construction that gen...
متن کاملLinear Programming Bounds for Distributed Storage Codes
A major issue of locally repairable codes is their robustness. If a local repair group is not able to perform the repair process, this will result in increasing the repair cost. Therefore, it is critical for a locally repairable code to have multiple repair groups. In this paper we consider robust locally repairable coding schemes which guarantee that there exist multiple alternative local repa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1709.05801 شماره
صفحات -
تاریخ انتشار 2017